Integer Programming Subject to Monomial Constraints

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The preemptive resource-constrained project scheduling problem subject to due dates and preemption penalties: An integer programming approach

Extensive research has been devoted to resource constrained project scheduling problem. However, little attention has been paid to problems where a certain time penalty must be incurred if activity preemption is allowed. In this paper, we consider the project scheduling problem of minimizing the total cost subject to resource constraints, earliness-tardiness penalties and preemption penalties, ...

متن کامل

Dis-equality Constraints in Linear/integer Programming

We have proposed an extension to the deenition of general integer linear programs (ILP) to accept dis-equality constraints explicitly. A new class of logical variables is introduced to transform the extended ILP in general form to standard form. Branch and Bound algorithm is modiied to solve this new class of ILP.

متن کامل

Approximability of Integer Programming with Generalised Constraints

We study a family of problems, called Maximum Solution, where the objective is to maximise a linear goal function over the feasible integer assignments to a set of variables subject to a set of constraints. When the domain is Boolean (i.e. restricted to {0, 1}), the maximum solution problem is identical to the well-studied Max Ones problem, and the approximability is completely understood for a...

متن کامل

Monomial geometric programming with fuzzy relation equation constraints

In this paper, an optimization model with an objective function as monomial subject to a system of the fuzzy relation equations with max-bounded difference (maxBD) composition operator is presented. We firstly determine its feasible solution set. Then some special characteristics of its feasible domain and the optimal solutions are studied. Some procedures for reducing and decomposing the probl...

متن کامل

SCIL - Symbolic Constraints in Integer Linear Programming

We describe SCIL. SCIL introduces symbolic constraints into branch-and-cut-and-price algorithms for integer linear programs. Symbolic constraints are known from constraint programming and contribute signi cantly to the expressive power, ease of use, and e ciency of constraint programs.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SIAM Journal on Optimization

سال: 2010

ISSN: 1052-6234,1095-7189

DOI: 10.1137/090764402